Star-critical Gallai-Ramsey numbers involving the disjoint union of triangles
نویسندگان
چکیده
In the Ramsey theory of graphs, star-critical Gallai-Ramsey numbers serve as a measure strength their corresponding numbers. this paper, we evaluate some classes when arguments are disjoint unions K3-subgraphs. The methods used constructive and in all cases considered, find that removal single edge destroys property.
منابع مشابه
Star-critical Ramsey numbers
The graph Ramsey number R(G,H) is the smallest integer r such that every 2-coloring of the edges of Kr contains either a red copy of G or a blue copy of H . We find the largest star that can be removed from Kr such that the underlying graph is still forced to have a red G or a blue H . Thus, we introduce the star-critical Ramsey number r∗(G,H) as the smallest integer k such that every 2-colorin...
متن کاملThe Ramsey Numbers for Disjoint Union of Stars
The Ramsey number for a graph G versus a graph H, denoted by R(G,H), is the smallest positive integer n such that for any graph F of order n, either F contains G as a subgraph or F contains H as a subgraph. In this paper, we investigate the Ramsey numbers for union of stars versus small cycle and small wheel. We show that if ni ≥ 3 for i = 1, 2, . . . , k and ni ≥ ni+1 ≥ √ ni − 2, then R( ∪k i=...
متن کاملStar-Avoiding Ramsey Numbers
The graph Ramsey number R(G,H) is the smallest integer n such that every 2-coloring of the edges of Kn contains either a red copy of G or a blue copy of H . We find the largest star that can be removed from Kn such that the underlying graph is still forced to have a red G or a blue H . Thus, we introduce the star-avoiding Ramsey number r∗(G,H) as the smallest integer k such that every 2-colorin...
متن کاملThe Ramsey numbers for disjoint union of trees versus W 4
The Ramsey number for a graph G versus a graph H, denoted by R(G, H), is the smallest positive integer n such that for any graph F of order n, either F contains G as a subgraph or F contains H as a subgraph. In this paper, we investigate the Ramsey numbers for union of trees versus small cycle and small wheel. We show that if ni is odd and 2ni+1 ≥ ni for every i, then R( Sk i=1 Tni , W4) = R(Tn...
متن کاملHypergraph Ramsey numbers: Triangles versus cliques
A celebrated result in Ramsey Theory states that the order of magnitude of the trianglecomplete graph Ramsey numbers R(3, t) is t/ log t. In this paper, we consider an analogue of this problem for uniform hypergraphs. A triangle is a hypergraph consisting of edges e, f, g such that |e∩ f | = |f ∩ g| = |g ∩ e| = 1 and e ∩ f ∩ g = ∅. For all r ≥ 2, let R(C3,K t ) be the smallest positive integer ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The art of discrete and applied mathematics
سال: 2022
ISSN: ['2590-9770']
DOI: https://doi.org/10.26493/2590-9770.1530.79c